package com.programmercarl.dp;

/**
 * https://leetcode.cn/problems/unique-binary-search-trees/description/
 * 96.不同的二叉搜索树 参考
 *
 * @author yulongtian
 * @create 2025-02-12 22:32
 */
public class Test07 {
    public static void main(String[] args) {

    }

    public int numTrees(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }

}
